A selectivity model for fragmented relations: applied in information retrieval
نویسندگان
چکیده
منابع مشابه
A selectivity model for fragmented relations in information retrieval
New application domains cause todays database sizes to grow rapidly, posing great demands on technology. Data fragmentation facilitates techniques (like distribution, parallelization, and main-memory computing) meeting these demands. Also, fragmentation might help improving efficient processing of query types such as top N. Database design and query optimization require a good notion of the cos...
متن کاملA selectivity model for fragmented relations: Evaluated for different standard data distributions
In the estimation of selectivity, many models assume that data is uniformly distributed, which is not true for many applications. In this paper, we discuss a generalized selectivity model, the so-called lαβ-model which is independent of the data distribution. The model predicts the fraction of a relation that should be selected in order to process a query. We have evaluated this model for diffe...
متن کاملquantum model for information retrieval in web 2.0
the study deals with the possibility of information loss in web 2.0 due to the interaction between the overload and the real information. using gottesman and preskill method, this investigation has proposed a mechanism to calculate the amount of information transformation in web 2.0. in this proposal, there are three different hilbert spaces that belong to the degrees of freedom of outside, ins...
متن کاملPublic Transport Ontology for Passenger Information Retrieval
Passenger information aims at improving the user-friendliness of public transport systems while influencing passenger route choices to satisfy transit user’s travel requirements. The integration of transit information from multiple agencies is a major challenge in implementation of multi-modal passenger information systems. The problem of information sharing is further compounded by the multi-l...
متن کاملLearning Preference Relations for Information Retrieval
In this paper we investigate the problem of learning a preference relation i~om a given set of ranked documents. We show that the Bayes’s optimal decision function, when applied to learning a preference relation, may violate transitivity. This is undesirable for information retrieval, because it is in conflict with a document ranking based on the user’s preferences. To overcome this problem we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2004
ISSN: 1041-4347
DOI: 10.1109/tkde.2004.1277824